Making Higher-Order Superposition Work
نویسندگان
چکیده
Superposition is among the most successful calculi for first-order logic. Its extension to higher-order logic introduces new challenges such as infinitely branching inference rules, possibilities reasoning about Booleans, and need curb explosion of specific rules. We describe techniques that address these issues extensively evaluate their implementation in Zipperposition theorem prover. Largely thanks use, won division CASC-J10 competition.
منابع مشابه
Implementation of Lambda-Free Higher-Order Superposition
In the last decades, first-order logic (FOL) has become a standard language for describing a large number of mathematical theories. Numerous proof systems for FOL which determine what formulas are universally true emerged over time. On the other hand, higher-order logic (HOL) enables one to describe more theories and to describe existing theories more succinctly. Due to more complicated higher-...
متن کاملHigher-Order Superposition for Dependent Types
In this paper we extend the higher-order critical pair criterion, as described in [9], to the LF framework [10], a calculus with dependent types. The notion of dependence relation is introduced, and used to restrict rewriting to those cases where well-typedness is preserved. This work was supported by NSF Grant CCR-9303383 The views and conclusions contained in this document are those of the au...
متن کاملSuperposition for Lambda-Free Higher-Order Logic
We introduce refutationally complete superposition calculi for intentional and extensional λ-free higher-order logic, a formalism that allows partial application and applied variables. The intentional variants perfectly coincide with standard superposition on first-order clauses. The calculi are parameterized by a well-founded term order that need not be compatible with arguments, making it pos...
متن کاملWork E cient Higher-Order Vectorisation (Unabridged)
Existing approaches to higher-order vectorisation, also known as flattening nested data parallelism, do not preserve the asymptotic work complexity of the source program. Straightforward examples, such as sparse matrix-vector multiplication, can suffer a severe blow-up in both time and space, which limits the practicality of this method. We discuss why this problem arises, identify the mis-hand...
متن کاملSuperposition-Based Order Analysis
Topology preservation, the central feature of SOM, proves to be difficult to define and quantify. We propose new criteria and measurements for order preservation, based on the superposition of neuron cells in the input space. As an application, we establish a taxonomy of topological errors and disorder states and use it for error detection in 2-dimensional SOM during the first learning epochs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2022
ISSN: ['0168-7433', '1573-0670']
DOI: https://doi.org/10.1007/s10817-021-09613-z